Optimization-based Approximate Dynamic Programming
نویسندگان
چکیده
OPTIMIZATION-BASED APPROXIMATE DYNAMIC PROGRAMMING
منابع مشابه
OPTIMIZATION OF A PRODUCTION LOT SIZING PROBLEM WITH QUANTITY DISCOUNT
Dynamic lot sizing problem is one of the significant problem in industrial units and it has been considered by many researchers. Considering the quantity discount in purchasing cost is one of the important and practical assumptions in the field of inventory control models and it has been less focused in terms of stochastic version of dynamic lot sizing problem. In this paper, stochastic dyn...
متن کاملApproximate Incremental Dynamic Analysis Using Reduction of Ground Motion Records
Incremental dynamic analysis (IDA) requires the analysis of the non-linear response history of a structure for an ensemble of ground motions, each scaled to multiple levels of intensity and selected to cover the entire range of structural response. Recognizing that IDA of practical structures is computationally demanding, an approximate procedure based on the reduction of the number of ground m...
متن کاملSwarm-based approximate dynamic optimization process for discrete particle swarm optimization system
This paper presents a convergence analysis of particle swarm optimization system by treating it as a discrete-time linear time-variant system firstly. And then, based on the results of system convergence conditions, dynamic optimal control of a deterministic PSO system for parameters optimization is studied by using dynamic programming; and an approximate dynamic programming algorithm – swarm-b...
متن کاملPortfolio Optimization with Position Constraints: an Approximate Dynamic Programming Approach
We analyze dynamic portfolio choice problems using an approximate dynamic programming (ADP) algorithm. We extend the algorithm to the case of constraints on borrowing and implement a duality-based simulation procedure for estimating bounds on the true value function. We demonstrate that the ADP solution exhibits a high degree of accuracy in the considered examples, indicating that this is a pro...
متن کاملApproximate Dynamic Programming By Minimizing Distributionally Robust Bounds
Approximate dynamic programming is a popular method for solving large Markov decision processes. This paper describes a new class of approximate dynamic programming (ADP) methods— distributionally robust ADP—that address the curse of dimensionality by minimizing a pessimistic bound on the policy loss. This approach turns ADP into an optimization problem, for which we derive new mathematical pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2010